Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Huffman code - перевод на Английский
общая лексика
код Хаффмана
код, предложенный в 1952 г. (D.A. Huffman), в котором длина кодирующего слова обратно пропорциональна встречаемости кодируемого элемента, т.е. часто встречающимся элементам соответствуют короткие коды, редко встречающимся - длинные. Используется в факсимильных аппаратах Group 3
Смотрите также
общая лексика
защитный код
![A portion of the "[[Zimmermann Telegram]]" as decrypted by [[British Naval Intelligence]] codebreakers. The word ''Arizona'' was not in the German codebook and had therefore to be split into phonetic syllables.](https://commons.wikimedia.org/wiki/Special:FilePath/Ztel2.jpg?width=200 "A portion of the \"[[Zimmermann Telegram]]\" as decrypted by [[British Naval Intelligence]] codebreakers. The word ''Arizona'' was not in the German codebook and had therefore to be split into phonetic syllables.")
![The Napoleonic Code in the [[Historical Museum of the Palatinate]] in [[Speyer]]](https://commons.wikimedia.org/wiki/Special:FilePath/Speyer (DerHexer) 2010-12-19 051.jpg?width=200 "The Napoleonic Code in the [[Historical Museum of the Palatinate]] in [[Speyer]]")
2) код; шифр, индекс || кодировать; шифровать
- codes of fair competition
- activity code
- alphanumeric code
- census product code
- correcting code
- depreciation code
- enumerator code
- Federal supply code for manufactures
- input code
- item name code
- labor code
- machine code
- minimum list heading code
- occupation code
- operation code
- output code
- payroll size code
- project code
- safety code
- standard code
- Uniform commercial code
- United Nations code
- vendor code
Определение
Википедия
In computer science and information theory, a Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. The process of finding or using such a code proceeds by means of Huffman coding, an algorithm developed by David A. Huffman while he was a Sc.D. student at MIT, and published in the 1952 paper "A Method for the Construction of Minimum-Redundancy Codes".
The output from Huffman's algorithm can be viewed as a variable-length code table for encoding a source symbol (such as a character in a file). The algorithm derives this table from the estimated probability or frequency of occurrence (weight) for each possible value of the source symbol. As in other entropy encoding methods, more common symbols are generally represented using fewer bits than less common symbols. Huffman's method can be efficiently implemented, finding a code in time linear to the number of input weights if these weights are sorted. However, although optimal among methods encoding symbols separately, Huffman coding is not always optimal among all compression methods - it is replaced with arithmetic coding or asymmetric numeral systems if a better compression ratio is required.
